A Universal Primal-Dual Convex Optimization Framework
نویسندگان
چکیده
In recent years, longitudinal data have become increasingly relevant in many applications, heightening interest in selecting the best longitudinal model to analyze them. Too often traditional practices rather than substantive theory guide the specific longitudinal model selected for the analysis. This opens the possibility that alternative models might better correspond to the data. In this regard, Bollen and Curran (2004) developed the Autoregressive Latent Trajectory (ALT) model. It captures the desirable features of both latent growth curve and autoregressive models, having the ability to discriminate between these two approaches to model panel data. The purpose of this paper is to develop the Latent Variable ALT (LV-ALT) model as a generalization of the autoregressive latent trajectory model. We show how the LV-ALT under constraints can specialize to a wide variety of other longitudinal models. Hence, if theory or prior work dictate the model, then latent variable ALT is likely capable of specializing to that structure. On the other hand, if there is little guidance on the best model, then the LV-ALT provides a way to empirically compare a wide variety of models and determine the most appropriate for the data. The latent variable ALT model also provides a framework which reveals the connections between many longitudinal models that were previously considered as distinct.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملA Primal-Dual Algorithmic Framework for Constrained Convex Minimization
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov’s excessive gap technique in a structured fashion and unifies it with smoothing and primal-dual...
متن کاملA Universal Primal-Dual Convex Optimization Framework
A Universal Primal-Dual Convex Optimization Framework In this supplementary document, we provide the technical proofs and additional implementation details, and it is organized as follows: Section A defines the key estimates, that forms the basis of the universal gradient algorithms. Sections B and C present the proofs of Theorems 4.1 and 4.2 respectively. Finally, Section D provides the implem...
متن کاملGeneralization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form
We generalize primal-dual interior-point methods for linear programming problems to the convex optimization problems in conic form. Previously, the most comprehensive theory of symmetric primal-dual interior-point algorithms was given by Nesterov and Todd 8, 9] for the feasible regions expressed as the intersection of a symmetric cone with an aane subspace. In our setting, we allow an arbitrary...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملCommunication-Efficient Distributed Primal-Dual Algorithm for Saddle Point Problem
Primal-dual algorithms, which are proposed to solve reformulated convex-concave saddle point problems, have been proven to be effective for solving a generic class of convex optimization problems, especially when the problems are ill-conditioned. However, the saddle point problem still lacks a distributed optimization framework where primal-dual algorithms can be employed. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015